Approximate solutions for a stochastic lot-sizing problem with partial customer-order information
نویسندگان
چکیده
منابع مشابه
Approximate solutions for a stochastic lot-sizing problem with partial customer-order information
We address a stochastic single item production system in a make-to-stock environment with partial knowledge on future demand resulting from customers ordering in advance of their actual needs. The problem consists of determining the optimal size of a production lot to replenish inventory, so that delivery promises are met on time at the expense of minimal average costs. For this problem an opti...
متن کاملA Capacitated Lot Sizing Problem with Stochastic Setup Times
In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...
متن کاملA stochastic approach for the Lot Sizing problem
In this paper we extend the generalized surrogate optimization approaches and the stochastic comparison so as to tackle the lot-sizing problem in manufacturing system. In practice, with the surrogate methodology, the lot sizes are continuously adjusted on-line by the gradient-based approaches. The lot sizing determines the number of parts batched together for production. We utilize the queueing...
متن کاملFix and Relax Heuristic for a Stochastic Lot-Sizing Problem
This paper addresses a particular stochastic lot-sizing and scheduling problem. The evolution of the uncertain parameters is modelled by means of a scenario tree and the resulting model is a multistage stochastic mixed-integer program. We develop a heuristic approach that exploits the specific structure of the problem. The computational experiments carried out on a large set of instances have s...
متن کاملApproximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times
We develop new algorithmic approaches to compute provably near-optimal policies for multi-period stochastic lot-sizing inventory models with positive lead times, general demand distributions and dynamic forecast updates. The policies that are developed have worst-case performance guarantees of 3 and typically perform very close to optimal in extensive computational experiments. The newly propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2003
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(02)00488-5